On minimum degree, leaf number, traceability and Hamiltonicity in graphs
نویسندگان
چکیده
منابع مشابه
Spectral radius and Hamiltonicity of graphs with large minimum degree
We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in G. Let G be a graph of order n and λ (G) be the spectral radius of its adjacency matrix. One of the main results of the paper is the following theorem: Let k 2, n k3 + k + 4, and let G be a graph of order n, with minimum degree δ (G) k. If λ (G) n k 1, then G has a Hamiltonian cycle, unless G = K1 _ (Kn k...
متن کاملOn Independent Domination Number of Graphs with given Minimum Degree
We prove a new upper bound on the independent domination number of graphs in terms of the number of vertices and the minimum degree. This bound is slightly better than that by J. Haviland 3] and settles Case = 2 of the corresponding conjecture by O. Favaron 2].
متن کاملOn Eulerianity and Hamiltonicity in Annihilating-ideal Graphs
Let $R$ be a commutative ring with identity, and $ mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ mathrm{A}(R)^{*}=mathrm{A}(R)setminuslbrace 0rbrace $ and two distinct vertices $ I $ and $ J $ are adjacent if and only if $ IJ=0 $. In this paper, conditions under which $AG(R)$ is either E...
متن کاملChromatic number and minimum degree of Kr+1-free graphs
Let (G) be the minimum degree of a graph G: A number of results about trianglefree graphs determine the maximum chromatic number of graphs of order n with (G) n=3: In this paper these results are extended to Kr+1-free graphs of order n with (G) (1 2= (2r 1))n: In particular: (a) there exist Kr+1-free graphs of order n with (G) > (1 2= (2r 1))n o (n) and arbitrary large chromatic number; (b) if ...
متن کاملSignless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.12.028